Reduced-sttd- interference trasmission method

ABSTRACT

The invention relates to a transmission method wherein n antennae emit each symbol with a spread spectrum code, said codes being the same for n antennae at each transmission considered from k transmissions, where k is an even number, and the symbols are coded according to k successive codes corresponding to k transmissions, said k codes comprising k/2 pairs of codes which verify, in each pair, the properties according to which a pair code is time-inverted and combined in relation to the other code of the pair and optionally multiplied by a module 1 complex constant.

[0001] The technical field to which this invention relates is that of digital communications, in particular wireless communications. The systems to which the invention mostly relates are multicarrier systems and spread spectrum systems or any system formed from the combination of these two systems, including MC-CDMA.

[0002] Wireless communications are used for example in cellular networks, in a local radio loop and in RF broadcasting.

[0003] The exponential growth in wireless communications makes it crucial to optimize the use of the RF spectrum, a rare and expensive resource.

[0004] The invention proposes to contribute to this optimization in two ways:

[0005] by improving the transmitter/receiver link budgets, thereby making it possible to extend the radio coverage for given transmission power. However, the power transmitted is generally limited by the technology (linearity, etc) and the cost of the amplifiers, also by the energy consumption (battery, etc)

[0006] by increasing the capacity of cellular radio systems, itself dependent on the quality of the links.

[0007] Transmit antenna diversity is a means of carrying out this optimization by exploiting the properties of the propagation channel linking the transmitter to the receiver.

[0008] In the field of mobile telephony, the propagation channel between the base and the mobile exhibits a random character, caused by the recombining of the multipaths created by reflections off buildings and various obstacles present in the environment.

[0009] Frequency selective fadeouts thus occur and may impair the quality of the communications. Two antennas are said to be in diversity when the channels linking them to the same mobile are statistically uncorrelated.

[0010] Diversity can be obtained either by placing the antennas a sufficient distance apart, or by using differently polarized antennas, or by diverse polarization accesses of the same physical antenna, or by any other means.

[0011] Receive antenna diversity has been known for a very long time as a means of combating these fadeouts. Specifically, if the waves picked up are statistically uncorrelated, this will make it possible through diverse processing means: selection, combination, etc . . . to obtain less frequent and/or less severe decays. One therefore obtains a first gain afforded by the presence of several receivers (the power received is multiplied accordingly), and a second due to the above processing. This second gain may be substantial [1], and is correspondingly bigger for very low error rates.

[0012] Transmit diversity at the base station is more expensive than receive diversity, since it requires two transmitters, for example one at each of the antennas. The benefits stem from the same origin: transmitting the signal via two statistically uncorrelated paths. However, the first of the two gains cited above for receive diversity disappears: there is now just one receiver. Only the second gain remains.

[0013] Transmit diversity is the main application of the invention.

[0014] In the case of a single channel consisting of several paths, it is known how to best isolate the repetitions of one and the same signal received by way of the various paths, although these offset repetitions arrive in a superposed manner at the receiver.

[0015] For this, a method called rake reception is known, when each sample is processed by spectrum spreading.

[0016] Spectrum spreading was initially used to combat interference and/or to multiplex several communications. Spectrum spreading actually makes it possible to combat extra-cellular scrambling, and allows the multiplexing of the various users: the latter share the same frequency band and are differentiated by their spreading sequence, the code, as explained hereinbelow.

[0017] The spreading is therefore carried out by multiplying each symbol transmitted by a string of chips, forming a code of length equal to the spreading factor. The code is not necessarily the same for each symbol. The frequency band required to transmit such a signal is increased by a factor F, hence the name “spread spectrum”.

[0018] The spreading therefore consists in going from the symbol rate to the chip rate, which is faster, the ratio of the two being dubbed the spreading factor (F), and generally being equal to 2^(k). The duration of a symbol being T, that of a chip being T_(chip), we have T/T_(chip)=F.

[0019] Finally, each chip is shaped by a pulse P_(chip)(t) in general a Nyquist root filter.

p ₀ =∫|p _(n)(t)|² dt=F*∫(p _(chip)(t))² dt

[0020] The transmission channel is customarily regarded as a sum of Diracs, that is to say as one and the same signal repeated and superposed on itself several times, with several variable offsets that are in practice much shorter than the duration of a spread symbol.

[0021] Through rake reception it is known how to satisfactorily isolate these various superposed repetitions of the signal at the level of the mobile, by virtue of a method for identifying the repetition of peaks in the superposed signal, and for determining the start of each superposed signal.

[0022] More precisely, the signals transmitted consisting of a string of symbols each coded as a series of very fast chips, a filter matched to the coding is applied each time that the start of a sequence corresponding to the coding of a symbol is detected.

[0023] This matched filter is therefore applied several times to similar signals corresponding to various paths, offset with respect to one another. With each application of the matched filter, the offset sequences will give rise to only fairly weak noise.

[0024] Thus, as represented in FIG. 1, the so-called RAKE technique or rake receiver uses the coding to isolate, in a superposed signal 10, signals 20, 30, 40 each corresponding to one and the same coding of one and the same symbol, for several paths transmitting a symbol S_(n).

[0025] One and the same signal corresponding to the coding of one and the same symbol S_(n) is thus isolated several times so as to obtain several evaluations h₁S_(n), h₂S_(n), h₃S_(n) . . . of the value of the symbol S_(n), each time affected by a transmission factor h₁, h₂, h₃ . . . corresponding to the effect of the particular path.

[0026] A channel-matched filter is applied to the values h₁S_(n),h₂S_(n), h3S_(n) . . . obtained, the function of this filter being to deliver a series of evaluations of sn, the effect of whose p paths h₁, h₂, h₃, . . . has been favorably combined. The latter matched filter is estimated by the mobile according to a technique that will not be detailed here.

[0027] For each delay associated with one of the paths selected a correlation is performed through the conjugate of the code modulating the symbol, the result of the correlation is multiplied by the conjugate of the estimate of the amplitude of the path, and the various results are summed.

[0028] Thus, the rake receiver is a matched filtering, simplified in that: the approximation is made that the channel is formed of a finite number of paths delayed with respect to one another (the impulse response of the channel is therefore formed of a string of Dirac pulses). The matched filtering is done only by taking account of these paths.

[0029] A method dubbed STTD for best exploiting the information carried by the samples transmitted by way of several antennas and arriving at one and the same mobile in a superposed manner is thus also known.

[0030] The concept of STTD has been presented [3] as applying to a transmission of modulated symbols in a channel with frequency-unselective impulse response, (i.e., a complex multiplicative constant), the transmitter consisting of two sensors. The transmission chain is represented in baseband, that is to say after passing through the matched filters and sampling.

[0031] A typical example of implementing STTD may be summarized thus: the symbols are grouped in twos. While the first antenna is transmitting the symbols in the order in which they arrive (as it would do if the transmission had occurred on a single antenna), the second transmits the complex conjugates of the same symbols, but in a modified order, and moreover with a change of sign every other time: the second antenna transmits −s_(n+1)*, S_(n)* (* signifies complex conjugate) while the first is transmitting sn, sn+1. Likewise for the subsequent symbols, S_(n+2), s_(n+3) etc.

[0032] It may be shown that, if the estimation of the channels is perfect on reception (the problems of channel estimation are outside our concern), the expression for the symbols before detection is similar to that which would be provided by a diversity receiver of the “Maximal ratio receiver combining” type [3], the signals being transmitted on a single antenna, and received on two antennas, the propagation channels linking the single transmitter to each receiver being the same ones respectively as those linking each of the transmission antennas to the single receiver of the STTD.

[0033] To summarize, the symbols to be transmitted are considered pairwise, they are transmitted while inverting the symbols of the pair on one antenna by inverting the signs of chosen symbols, and transmitting the conjugate of chosen symbols, so as to obtain a 2×2 transmission matrix which is orthogonal.

[0034] Thus, it is easy to solve a 2×2 linear equation which, because the mobile knows the transmission functions of the various paths, makes it possible to deduce therefrom independently the transmitted and superposed initial symbols s_(n) and s_(n+1) of the simultaneous transmission by two antennas. The maximum information transmitted by these two antennas is therefore derived by harnessing the transmission by two antennas in terms of transmission efficiency.

[0035] This method has already been generalized to a larger number of antennas, whether the orthogonal transmission matrix be square or otherwise.

[0036] The matrix may not be strictly orthogonal, but give by multiplication with its conjugate transpose a matrix which is substantially diagonal, that is to say which exhibits small and/or sparse values off the diagonal, this being acceptable in certain cases.

[0037] The symbols may be grouped in p-tuples, other than pairs. The number of antennas n may be different from the number p of symbols per group.

[0038] These p-tuples are transmitted by the transmissions, k possibly being different from p and from n, a substantially orthogonal matrix can be obtained which is not necessarily square.

[0039] The equations are typically the following in the case of two antennas and of transmission in pairs of symbols:

[0040] Let {s_(n)} be the string of symbols to be transmitted. The first antenna will transmit {s_(n)} in this order, while the second antenna is transmitting the same symbols in a modified order. The symbols are grouped in twos.

[0041] For example, the second antenna transmits −s_(2n+1)*, s_(2n)* (* signifies complex conjugate) while the first is transmitting s_(2n), s_(2n+1). To streamline the notation, and since the parity of the first index of the two grouped symbols is of no importance, they will subsequently be denoted s_(n) and s_(n+1).

[0042] The baseband representation of the system is considered, and the channels involved are considered to group together the effects of the transmission/reception filters and also of the propagation. Let h1 (respectively h2) be the channel linking the first (resp. second) antenna to the mobile.

[0043] We have

y _(n) =h ₁ s _(n) −h ₂ s _(n+1) * +b _(n)   (1)

y _(n+1) =h ₁ s _(n+1) +h ₂ s _(n) *+b _(n+1)   (2)

[0044] where b_(n) denotes the noise of the receiver at time n.

[0045] The second equation is conjugated:

y _(n+1) *=h ₁ *s _(n+1) *+h ₂ *s _(n) +b _(n+1)

[0046] After passing through the filters matched to the various channels, we have:

y _(n) ¹=(|h ₁|² s _(n) −h ₂ h ₁ *s _(n+1)*)+h ₁ *b _(n)   (3)

y _(n) ²=(h ₂ h ₁ *s _(n+1) *+|h ₂|² s _(n))+h ₂ b _(n+1)   (4)

[0047] By adding (3) and (4) we obtain:

(3)+(4)=s _(n)(|h ₁|² +|h ₂|²)+h ₁ *b _(n) +h ₂ b _(n+1)   (5)

[0048] By interchanging the roles of h₁ and of h₂ in (3) and after linearly combining the results, we likewise have:

s _(n+1)(|h ₁|² +h ₂|²)+h ₁ b _(n+1*) −h ₂ *b _(n)   (6)

[0049] It is therefore seen that, to within a sign on one of the noise terms in (6)—this does not change the power of the noise—everything takes place as if the data to be transmitted, s, were transmitted in succession by a single antenna, were filtered by two channels h1 and h2, and were received by a receiver performing optimal combining of the data received at each symbol time.

[0050] The estimation of the channels, prior to the matched filtering, is assumed here to be perfect. The estimation of the channels will not be detailed here.

[0051] It has been proposed that the techniques of STTD and of rake reception recalled hereinabove be combined.

[0052] Thus, the 3GPP [4] has adopted STTD in UMTS FDD.

[0053] It has been proposed that these two methods be associated in the case where a multitude of paths are superposed with a coding of the symbols and where transmission takes place via two diversity antennas.

[0054] On each channel, the ripples corresponding to the superpositions of simultaneously coded symbols are firstly separated so that each path corresponding to one and the same instant of transmission is separated (rake reception).

[0055] Then a decoding is applied to each ripple of chips (despreading) to obtain values of superposition of two symbols transmitted simultaneously by the two antennas. Stated otherwise, each superposition of symbols is despread. Then, these symbols being transmitted in pairs according to an orthogonal transmission matrix, the orthogonality of the matrix is exploited so as to de-superpose the initial samples.

[0056] Stated otherwise, the paths are separated by detecting peaks (step 1 in FIG. 2), then the signals carried by the peaks are decoded pathwise (despreading), doing so twice in succession (step 2 in FIG. 2), and the symbols of the pair are separated by exploiting the orthogonality of 2×2 transmission matrix corresponding to these two successive instants (step 3 in FIG. 2).

[0057] The information which is repeated through the presence of various paths is therefore firstly separated (rake reception) and the equations stemming from the orthgonality of the transmission matrix are applied so as to deduce therefrom the two (STTD) initial symbols of each pair.

[0058] The orthogonality of the transmission matrix is exploited several times, corresponding to the various isolated paths. It will be noted that in order to do this, the time offsets between paths are preferentially very small compared with the spreading of a symbol.

[0059] In this case, the demodulation of STTD type is done path by path, and the results of the calculations relating to each path are added together for each of the STTD symbols.

[0060] Stated otherwise, the STTD technique is generalized to frequency-selective channels, via a concept of rake receiver [1], preferably under the assumption that the length of the impulse response of the propagation channel is much shorter than the duration of a symbol.

[0061] The equations corresponding to such a combination of methods are presented hereinbelow by way of detail.

[0062] The effect of the propagation channel is distinguished therein from that of the filter shaping the symbols transmitted. The propagation channel is in both cases a complex multiplicative constant. This presentation does not feature in [3].

[0063] It is noted that the spreading of symbols by codes, which is characteristic of any AMRC type system, including UMTS FDD, is merely one particular type of modulation applied to symbols and in which the code applied to the symbol transmitted plays the role of the shaping filter. These equations therefore apply to this type of transmission, where a single code is transmitted at a time, however.

[0064] The propagation channel linking the first (resp. second) antenna to the mobile is denoted h1 (respectively h2). These are complex constants. Let p_(n) (t) (resp. p_(n+1) (t)) be the shaping filter for the nth (resp. n+1st) symbol, transmitted over the interval nT≦t<(n+1)T (resp. (n+1)T≦t<(n+2)T) where T denotes the duration of a symbol. It will be assumed that p_(n) and p_(n+1) have temporal support approximately limited to [0, T]. Let y(t) be the signal received at the mobile.

[0065] We have:

y(t)=(h ₁ s _(n) −h ₂ s _(n+1)*)p _(n)(t−nT)+b(t)nT≦t<(n+1)T   (1bis)

y(t)=(h ₁ s _(n+1) +h ₂ s _(n)*)p _(n+1)(t−(n+1)T)+b(t) (n+1)T≦t<(n+2)T   (2bis)

[0066] b(t) denotes the noise of the receiver at time t.

[0067] After passing through the filters matched to the various channels and sampling at the symbol rate, we have:

y _(n) ¹=∫_((nT.(n+1)T]) y(t)h ₁ *p _(n)(t−nT)*dt=(|h ₁|² s _(n) −h ₂ h ₁ *s _(n+1)*)p ₀ +b _(n) ¹   (3bis)

y _(n) ²=∫_([(n+1)T, (n+2)T]) y(t)h ₂ *p _(n+1)(t−(n+1)T)*dt=(h ₂ *h ₁ s _(n+1) +|h ₂|² s _(n)*)p ₀ +b _(n+1) ²

[0068] where p₀=∫|p_(n)(t)|²dt=∫|p_(n+1)(t)|²dt

[0069] We conjugate the second equation:

y _(n) ²*=(h ₂ h ₁ *s _(n+1) *+|h ₂|² s _(n))p ₀ +b _(n+1) ²*   (4bis)

[0070] By adding (3) and (4) we obtain:

(3)+(4)=s _(n)(|h ₁|² +|h ₂|²)p ₀ +b _(n) ¹ +b _(n+1) ²*   (5bis)

[0071] By interchanging the roles of h₁ and of h₂ in (3) and after linearly combining the results, we likewise obtain:

s _(n+) ₁(|h ₁|² +|h ₂|²)p ₀+bruit   (6bis)

[0072] The estimation of the channels, prior to the matched filtering, is assumed to be perfect since the problems of imperfect estimation are off the subject.

[0073] It is seen that the above calculation encompasses the case where p_(n)(t) designates a spreading code shaped by the chip pulse in an AMRC system.

[0074] However, it is apparent that when rake reception is combined with the STTD technique, nuisance interference appears.

[0075] (It is already known that in a system with orthogonal codes the channel selectivity causes a break in the orthogonality of the codes).

[0076] The selectivity gives rise in particular to interference between the simultaneously transmitted symbols.

[0077] If two symbols, in particular consecutive ones, are in STTD, it is shown hereinbelow that additional interference occurs, caused by the second STTD symbol as well as by all those multiplexed by the codes transmitted during this second symbol time.

[0078] The aim of the invention is therefore mainly to reduce this intersymbol interference. By canceling the interference caused by the terms transmitted in the symbol duration of the second STTD symbol, interference which appears when the channel is frequency selective.

[0079] The result is a reduction of around ⅔ in the level of intersymbol interference, for equal complexity of the receiver.

[0080] The invention applies to STTD whether the spectrum spreading be carried out by means of mutually orthogonal codes or otherwise, and is not limited, in its main object, to 2×2 cases.

[0081] With this aim, the invention proposes a transmission method in which:

[0082] n antennas, n greater than or equal to 2, are used to transmit symbols grouped into p-tuples (S₁, . . . , S_(p)), while carrying out, for each p-tuple, k times a simultaneous sending of n symbols, the n symbols consisting each time of values from among S₁, . . . , S_(p) which are in a modified order and are assigned weights chosen selectively from among −1, 0 and 1, and are selectively conjugated, so that k linear superpositions of n symbols are transmitted in such a way as to constitute a transmission matrix of dimensions k×p which is substantially orthogonal;

[0083] the n antennas furthermore send each symbol with a spread spectrum coding, the codings being the same on the n antennas at each transmission concerned among the k transmissions;

[0084] the transmission being performed over a physical or contrived channel which constitutes substantially a sum of Diracs, so that each superposition of symbols is repeated several times on reception; in which method furthermore:

[0085] each superposition of n symbols is extracted with the aid of despreadings on reception several times;

[0086] these several extractions are done with the aid of despreadings for each of the k superpositions transmitted so that several estimations of k-tuples are obtained, each k-tuple forming a result of the k×p transmission matrix;

[0087] the orthogonality of the k×p matrix is exploited several times corresponding to each of the several k-tuple extractions, so that an estimation of the p-tuple (S₁, . . . , S_(p)) and therefore of each symbol S₁, . . . S_(p) is obtained several times;

[0088] and an estimation of each symbol S₁, . . . , S_(p) is deduced, sharpened on the basis of the symbols estimated several times,

[0089] characterized in that k is an even number, and that the symbols are coded according to k successive codes corresponding to the k transmissions, the k codes consisting of k/2 pairs of codes which satisfy, in each pair, the property according to which a code of the pair is time-inverted and conjugated with respect to the other code of the pair, and possibly multiplied by a complex constant of modulus 1.

[0090] Other characteristics, aims and advantages of the invention will become apparent on reading the detailed description which follows, given with reference to the appended figures in which:

[0091]FIG. 1 is a diagram illustrative of the rake reception technique;

[0092]FIG. 2 is a chart representing the successive steps implemented in a combination of the techniques of rake reception and of separation of symbols by transmission matrix orthogonality;

[0093]FIG. 3 represents a preferential arrangement of coding with reference to a transmission interval for a symbol of maximum length, according to the invention;

[0094]FIG. 4 represents a preferential arrangement of scrambling coding, according to the invention.

[0095] The mobile is in this example informed that the base station is employing it, in such a way as to perform the correlations of the rake receiver by the appropriate codes. This excepted, in this example the receiver is identical to that of the current STTD.

[0096] The inventors were able to identify that the interference between symbols arising when combining the STTD and rake reception techniques is of the type which will be set forth hereinbelow.

[0097] The impulse response of the channel linking the first (resp. the second) antenna to the mobile will be denoted h₁ (t) (resp. h₂ (t))

[0098] It will be assumed that, preferentially, the offsets between paths are small, compared with the duration of spreading of the symbols.

[0099] It will also be assumed that the temporal spreading of the channel is, preferentially, small compared with the length of a symbol. The latter condition makes it possible to neglect the intersymbol interference and to apply the rake receiver as described in [2].

[0100] The rake receiver being merely a simplified version of the filter matched to the propagation channel convolved with the spreading code of the symbol to be detected, we shall present its extension to the diversity reception of STTD transmission by writing it as a matched filter since-the presentation is simpler.

[0101] Let us firstly consider the case of a single user:

[0102] Let y(t) be the signal received at the mobile. We have:

y(t)=((h ₁ s _(n) −h ₂ s _(n+1)*)*p _(n))(t−nT)+b(t)nT≦t<(n+1)T   (12)

y(t)=((h ₁ s _(n+1) +h ₂ s _(n)*)* p _(n+1))(t−(n+1)T)+b(t)(n+1)T≦t<(n+2)T   (13)

[0103] * designates convolution and b(t) the noise of the receiver at time t. For greater clarity, it will be assumed that b(t)=0, since noise processing is not our concern.

[0104] It is more practical to express the above relations in the frequency domain.

[0105] Let H₁(f) (resp. H₂(f)) be the transfer function of the propagation channel, f denoting frequency. The Fourier transforms of equations (12) and (13) will be calculated respectively over the intervals [nT, (n+1)T] and [(n+1)T, (n+2)T]. It is therefore seen that the Fourier transforms of the coding p_(n) (resp. p_(n+1)) over the interval [0,T] are involved. They will be denoted C_(n) (f) (resp. C_(n+1)(f))

[0106] By assumption, they have an approximately finite support denoted B. The result of the Fourier transform of y(t) over the two intervals mentioned will depend on n via an index.

[0107] We therefore have:

Y _(n)(f)=(H ₁(f)S _(n) −s _(n+1) * H ₂(f))C _(n)(f)

Y _(n+1)(f)=(H ₁(f)s _(n+1) +s _(n) *H ₂(f))C _(n+1)(f)

[0108] In order to make the same variables appear in both equations, we conjugate the second:

Y _(n+1)(f)=(H ₁(f)s _(n+1) +s _(n) H ₂(f))C _(n+1)(f)*

[0109] We therefore obtain a system of two equations in two unknowns, that may be written in matrix form: $\begin{matrix} {\begin{bmatrix} {Y_{n}(f)} \\ {Y_{n + 1}^{*}(f)} \end{bmatrix} = {\begin{bmatrix} {{H_{1}(f)}\quad {C_{n}(f)}} & {{- {H_{2}(f)}}\quad {C_{n}(f)}} \\ {{H_{2}^{*}(f)}\quad {C_{n + 1}^{*}(f)}} & {{H_{1}^{*}(f)}\quad {C_{n + 1}^{*}(f)}} \end{bmatrix}\begin{bmatrix} s_{n} \\ s_{n + 1}^{*} \end{bmatrix}}} & (14) \end{matrix}$

[0110] To demodulate s_(n) and s_(n+1), we perform a matched filtering followed by a sampling at the instant 0.

[0111] The estimation of the various channels is assumed to be perfect on reception, since the problems of channel estimation are not our concern.

[0112] In the frequency domain, the matched filtering gives a matrix multiplication: $\begin{bmatrix} {{H_{1}^{*}(f)}\quad {C_{n}^{*}(f)}} & {{H_{2}(f)}\quad {C_{n + 1}(f)}} \\ {{- {H_{2}^{*}(f)}}\quad {C_{n}^{*}(f)}} & {{H_{1}(f)}\quad {C_{n + 1}(f)}} \end{bmatrix}{\quad{\begin{bmatrix} {Y_{n}(f)} \\ {Y_{n + 1}^{*}(f)} \end{bmatrix} = {\begin{bmatrix} {{H_{1}^{*}(f)}\quad {C_{n}^{*}(f)}} & {{H_{2}(f)}\quad {C_{n + 1}(f)}} \\ {{- {H_{2}^{*}(f)}}\quad {C_{n}^{*}(f)}} & {{H_{1}(f)}\quad {C_{n + 1}(f)}} \end{bmatrix}{\quad\quad {\begin{bmatrix} {{H_{1}(f)}\quad {C_{n}(f)}} & {{- {H_{2}(f)}}\quad {C_{n}(f)}} \\ {{H_{2}^{*}(f)}\quad {C_{n + 1}^{*}(f)}} & {{H_{1}^{*}(f)}\quad {C_{n + 1}^{*}(f)}} \end{bmatrix}\begin{bmatrix} s_{n} \\ s_{n + 1}^{*} \end{bmatrix}}\quad}}}}$

[0113] The sampling at the instant 0 is manifested in the frequency domain as an integral of each term of the matrix product over the frequency band B:

[0114] The first row of the matrix product on the right-hand side thus gives:

s _(n)∫_(B)(|H₁(f)C _(n), (f)|² +|H ₂(f)C _(n+1)(f)|²)df+s _(n+1+)*∫_(B) H ₁(f)*H ₂(f)(C _(n+1)(f)|² =31 |C _(n)(f)|²)df   (15)

[0115] The second row:

s _(n+1)*∫_(B)(|H ₁(f)C _(n,+1)(f)|² +|H ₂(f)C _(n)(f)|²)df+s _(n)∫_(B) H ₁(f)H ₂*(f)(|C _(n+1)(f)|² −|C _(n)(f)|²)df   (16)

[0116] The term I=∫_(B)H₁(f)*H₂(f)(|C_(n+1)(f)|²−|C_(n)(f)|²)df therefore generates nuisance interference. If this term is zero, then the STTD device behaves as formed of a transmitter with ONE sensor, transmitting s_(n) and s_(n+1)* IN SUCCESSION, and of a receiver with TWO sensors, and optimal reception [5].

[0117] The term I is zero among other things:

[0118] if C_(n+1)(f)=C_(n)(f) or else p_(n+1)(t)=p_(n)(t), this being the case if all the symbols are modulated by the same shaping filter (transmission of QPSK symbols modulated by a Nyquist filter for example),

[0119] or if C_(n+1)(f)=C_(n)*(f)

[0120] More generally, if C_(n+1)(f)=C_(n)*(f) e^(iφ) where φ is a constant.

[0121] By way of reminder, if the channels are frequency-unselective: H₁(f)=H₁ and H₂ (f)=H₂. In this case:

I=H ₁ *H ₂∫_(B)(|C _(n+1)(f)|² −|C _(n)(f)|²)df

[0122] Each term under the integral represents the energy of the shaping filters at the instants n and n+1. If these energies are equal, then I=0. This occurs for example in CDMA if each code has the same energy, this being the case in general.

[0123] However, in the general case of frequency-selective channels I≠0.

[0124] Let us now consider the case of several simultaneous users:

[0125] Let us take the example with 2 users with the same spreading factor of the above paragraph.

y(t)=((h ₁ s _(n) −h ₂ s _(n+1)*)*p _(n, user1))(t−nT)+((h ₁ d _(n) −h ₂ d _(n+1)*)) )* p_(n, user2))(t−nT) nT≦t<(n+1 )T

y(t)=((h ₁ s _(n+1) +h ₂ s _(n)*)*p _(n+1,user1))(t−(n+1)T)+((h ₁ d _(n+1) +h ₂ d _(n)*))* p _(n+1, user2))(t−(n+1)T) (n+1)T≦t<(n+2)T

[0126] this giving by Fourier transformation:

Y _(n)(f)=(H ₁(f)s _(n) −s _(n+1) *H ₂(f))C _(n, user1)(f)+(H ₁(f) d _(n) −d _(n+1) *H ₂(f))C _(n, user2)(f)

Y _(n+1)(f)=(H ₁(f)s _(n+1) +s _(n) *H ₂(f))C _(n+1, user1)(f)+(H ₁(f)d _(n+1) +d _(n) *H ₂(f))×C _(n+1,user2)(f)

[0127] Added to (14) are the extra terms originating from the second user, so that (15) becomes (15bis):

s _(n)∫_(B)(|H ₁(f)C _(n, user1)(f)|² +|H ₂(f)C _(n+1, user1)(f)|²)df+

d _(n)∫_(B)(|H ₁(f)|² C _(n, user2)(f)C _(n, user1)(f)*+|H ₂(f)|² C _(n+1, user2)(f)C _(n+1, user1)(f))df+

s _(n+1)*∫_(B) H ₁(f)*H ₂(f)(|C _(n+1, user1)(f)|² −|C _(n, user1)(f)|²)df

−d _(n+1)*∫_(B) H ₁(f)*H ₂(f)(C _(n, user2)(f)C _(n, user1)(f)*−C _(n+1, user2)(f)*C _(n+1, user1)(f))df

[0128] In the case where the mutually multiplexed codes are orthogonal, the first factor d_(n) term is due to the classical breaking of this orthogonality through the selectivity of the channel. The second factor d_(n+1)* term like the factor s_(n+1)* term is non-zero (apart from particular cases such as the end of D.1) and hence estimates of the second symbol time will cause noise in the estimation of s_(n). The same extra terms appear in (16) in the s_(n) and d_(n) factor and cause noise in the estimation of s_(n+1)*.

[0129] Thus, just as in (15bis), two terms originating from the second symbol appear that will disturb the estimation of s_(n). Now, a means of making them disappear exists. If we have:

C _(n+1, user1)(f)=C _(n, user1)(f)*exp(j phi)

[0130] For any index n designating the first of the two STTD symbols, and for any index j representing a user, and phi is a constant independent of n and of j, we see that the two disturbing terms disappear (those in the s_(n+1)* and d_(n+1)* factor)

[0131] We therefore have:

15bis=s _(n)∫_(B)(|H ₁(f)|² +|H ₂(f)|²)|C _(n, user1)(f)|2 df+

d _(n)∫_(B)(|H ₁(f)|² +|H ₂(f)|²)C _(n, user2)(f))C _(n, user1)(f)*df

[0132] Now, C_(n+1, userj)(f)=C_(n, useri)(f) exp (j phi) is realized in the time domain if:

p _(n+1, userj)(t)=p _(n, useri)(T−t)*.

[0133] This signifies that a spreading is implemented by codes which, for two different instants corresponding to two transmissions coupled by STTD, are mutually conjugated and inverted with respect to time.

[0134] When phi is different from zero, exp (jphi) is a complex constant with modulus 1 which gets applied to one of the two codes of the two STTD-grouped symbols, typically to the inverted and conjugated code.

[0135] The principle therefore consists for example in reversing the direction of time (and in conjugating) codes of length 256 at the rate of one out of two, by reversing the codes at the level of outputs of pairs of symbols associated with STTD.

[0136] Thus, in order for the additional interference terms caused by STTD to be made to disappear, the second STTD symbol must have a code obtained from the code of the first symbol by inverting the direction of time, and by conjugating it.

[0137] In the case of UMTS, this implies that the standard is modified in such a way that the OVSF codes are different for the 2 STTD symbols: by adding an index n to mark this dependence, we have:

[0138] C_(userj, n,k)=C_(userj, n+1, F−k+1)* with F=spreading factor, n designating the first of the two STTD symbols.

[0139] It is clear that it matters little whether it is the first or the second STTD symbol whose direction of time is inverted with respect to the usual order.

[0140] This advantage is also found in the case where the STTD technique is applied with a k×n, different from 2×2, transmission matrix. Specifically, if we have p symbols transmitted by n antennas together with the conjugates, inversion of time and of signs necessary for the k×p matrix to be orthogonal, the elimination of the above-presented interference is achieved by coding the symbols with one or more pairs of codes, in which pairs two codes are time-inverted and conjugated.

[0141] Generally, a p-tuple is transmitted over k transmission instants, with n antennas. k is chosen to be even, and, for k/2 transmissions, one or more given codes are used, and for the other k/2 transmissions the conjugates and temporal inverses of these codes are used.

[0142] In the case where several symbols of different lengths are considered transmitted simultaneously and hence codes applied simultaneously.

[0143] Let us recall that the signal transmitted by user 1 to modulate the n-th symbol was denoted by:

[0144] p_(n, user1) (t) 0≦t<T

[0145] Let us thus assume that user 2 has a different spreading factor from that of 1. Without loss of generality, it will be assumed that user 2 has a spreading factor half that of 1, hence double the symbol bit rate. While user 1 is transmitting s_(n), then s_(n+1), user 2 transmits 4 symbols, that will be denoted:

[0146] d_(n,1), d_(n,2), d_(n+1,1), d_(n+1,2)

[0147] For user 2, we denote:

[0148] p_(n,1, user)2 (t) 0≦t<T/2 to modulate the first half of the n-th symbol

[0149] p_(n,2, user2) (t) 0≦t<T/2 to modulate the second half of the n-th symbol

[0150] The support of p_(n,1, user2) and of p_(n,2, user2) is [0, T/2]

[0151] The signal received by the mobile may therefore be written:

y(t)=((h ₁ s _(n) −h ₂ s _(n+1)*)*p _(n, user1))(t−nT)+((h ₁ d _(n,1) −h ₂ d _(n,2)*))*p _(n,1, user2))(t−nT)+b(t) nT≦t<nT+T/2

y(t)=((h ₁ s _(n−) h ₂ s _(n+1)* )*p_(n, user1))(t−nT)+((h ₁ d _(n,2) +h ₂ d _(n,1)*))*p _(n,2, user2))(t−T/2−nT)+b(t) nT+T/2≦t<(n+1)T

y(t)=((h ₁ s _(n+1) +h ₂ s _(n)*)*p _(n+1, user1))(t−(n+1)T)+((h ₁ d _(n+1,1) −h ₂ d _(n+1,2)*))*p _(n+1,1,user2))(t−(n+1)T)+b(t)(n+1)T≦t<(n+1)T+T/2

y(t)=((h ₁ s _(n+1) +h ₂ s _(n)*)*p _(n+1, user1))(t−(n+1)T)+((h ₁ d _(n+1,2) +h ₂ d _(n+1,1)*)*p _(n+1,2,user2))(t−(n+1)T−T/2)+b(t) (n+1)T+T/2≦t<(n+2)T

[0152] In the Fourier domain, the transform of p_(n,1 user2) (t) over [0, T] will be denoted C_(n,1, user2) (f), that of p_(n,2 user2) (t) C_(n,2, user2) (f)

[0153] which gives

Y _(n)(f)=(H ₁(f)s _(n) −s _(n+1) *H ₂(f))C _(n, user1)(f)+H ₁(f)(d _(n,1) C _(n,1, user2)(f)+d _(n,2) C _(n,2 user2)(f))−H ₂(f) (d _(n,2) *C _(n,1, user2)(f)−d _(n,1) *C _(n,2, user2)(f))

Y _(n+1)(f)=(H ₁(f)s _(n+1) +s _(n) *H ₂(f))C _(n+1, user1)(f)+H ₁(f)(d _(n+1,1) C _(n+1,1, user2)(f)+d _(n+1,2) C _(n+1,2, user2)(f))−H ₂(f)(d _(n+1,2,*) C _(n+1,1, user2)(f)−d _(n+1,1) *C _(n+1,2, user2)(f)

[0154] So that (15 bis) becomes:

s _(n)∫_(B)(|H ₁(f)C _(n, user1)(f)|² +|H ₂(f)C _(n+1, user1)(f)|²)df+

∫_(B)(|H ₁(f)|²(d _(n,1) C _(n,1, user2)(f)+d _(n,2) C _(n,2, user2)(f))C _(n, user1)(f)*−|H ₂(f)|²(d _(n+1,2) C _(n+1,1, user2)(f)*−d _(n+1,1) C _(n+1,2, user2)(f)*)C _(n+1, user1)(f))df+s _(n+1) *∫ _(B) H ₁(f)*H ₂(f) (|C _(n+1, user1)(f)|² −|C _(n, user1)(f)|²)df−∫_(B) H ₁(f)*H ₂(f) (d _(n,2) *C _(n,1, user2)(f)−d _(n,1) *C _(n,2, user2)(f))C _(n, user1)(f)*−(d _(n+1,1) *C _(n+1,1, user2)(f)*+d _(n+1,2) Cn+1,2, user2 (f)* ) C _(n+1, user1)(f))df=s _(n)∫_(B)(|H ₁(f)C _(n, user1)(f)|² +|H ₂(f) C _(n+1, user1)(f)|²)df+d _(n,1)∫_(B) |H ₁(f)|² C _(n,1, user2)(f)C _(n, user1)(f)*df−d _(n+1,2)∫_(B) |H ₂(f)|² C _(n+1,1, user2)(f)*C _(n+1, user1)(f) df+d _(n,2)∫_(B) |H ₁(f)|² C _(n,2, user2)(f)C _(n, user1)(f)*df−d _(n+1,1)∫_(B) |H ₂(f)C _(n+1,2, user2)(f)*C _(n+1, user1)(f)df+S _(n+1)*∫_(B) H ₁(f)*H ₂(f)(|C _(n+1, user1)(f)|² −|C _(n, user1)(f)|² df+d− _(n+1,1)*∫_(B) H ₁(f)*H ₂(f)C _(n+1,1, user2)(f)C _(n+1, user1)(f)df+d _(n+1,2)*∫_(B) H ₁(f)*H ₂(f)C _(n+1,2, user2)(f)*C _(n+1, user1)(f)df−d _(n,2)*∫_(B) H ₁(f)*H ₂(f)C _(n,1, user2)(f)C _(n, user1)(f)*df+d _(n, 1)*∫_(B) H ₁(f)H ₂(f)C _(n,2 user2)(f))C _(n, user1)(f)*df

[0155] The noise terms are seen to appear.

[0156] These noise terms are also eliminated in this case by adopting a time-inverted and conjugate coding for the symbols grouped in pairs.

[0157] In this case, it is also necessary to apply STTD not to 2 consecutive symbols, but by grouping the symbols in the following manner: if the spreading factor is for example F_(max)/2, the 1st symbol is associated with the 4th and the 2nd with the 3rd. The 3rd and 4th symbols have inverted OVSF codes, thereby making it possible to preserve the orthogonality of the codes, when there is orthogonality, between code terms which are “the right way round” or “the wrong way round”.

[0158] It is shown below that by reversing the direction of time and by conjugating the 1st code (resp the 2nd) to form the 4th code (resp the 3rd), the interference terms are canceled as previously.

[0159] More precisely, the advantage in adopting such symmetry of coding is proven mathematically, for two different spreadings, as follows:

y(t)=((h ₁ s _(n) −h ₂ s _(n+1)*)*p _(n, user1))(t−nT)+((h ₁ d _(n,1) −h ₂ d _(n+1,2)*))*p _(n,1, user2))(t−nT)+b(t)nT≦t<nT+T/2

y(t)=((h ₁ s _(n) −h ₂ s _(n+1)*)*p _(n, user1))(t−nT)+((h ₁ d _(n,2) −h ₂ d _(n+1,1)*))*p _(n,2, user2))(t−T/2−nT)+b(t) nT+T/2≦t<(n+1)T

y(t)=((h ₁ s _(n+1) +h ₂ s _(n)*)*p _(n+1, user1))(t−(n+1)T)+((h ₁ d _(n+1,1) +h ₂ d _(n, 2)*))*p _(n+1,1, user2))(t−(n+1)T)+b(t) (n+1)T≦t<(n+1)T+T/2

y(t)=((h ₁ s _(n+1) +h ₂ s _(n)*)*p _(n+1, user1))(t−(n+1)T)+((h ₁ d _(n+1,2) +h ₂ d _(n,1)*)*p _(n+1,2, user2))(t−(n+1)T−T/2)+b(t) (n+1)T+T/2≦t<(n+2)T

[0160] which in the Fourier domain gives:

Y _(n)(f)=(H ₁(f)s _(n) −s _(n+1) *H ₂(f)C _(n, user1)(f)+H ₁(f) (d _(n,1) C _(n,1, user2)(f)+d _(n,2) C _(n,2, user2)(f))−H ₂(f)(d _(n+1,2) *C _(n,1, user2)(f)+d _(n+1,1) * C _(n,2, user2) 9 f)

Y _(n+1)(f)=(H ₁(f)s _(n+1) +s _(n) *H ₂(f))C _(n+1, user1)(f)+H ₁(f)(d _(n+1,1) C _(n+1,1, user2)(f)+d _(n+1,2) C _(n+1,2, user2)(f))+H ₂(f) (d _(n,2) *C _(n+1,1, user2)(f)+d _(n,1) C _(n+1,2, user2)(f)

[0161] so that (15bis) becomes:

s _(n)∫_(B)(|H ₁(f)C _(n, user1)(f)|² +|H ₂(f)C _(n+1, user1)(f)|²)df+

∫_(B)(|H ₁(f)|²(d _(n,1) C _(n,1, user2)(f)+d _(n,2) C _(n,2, user2)(f)) C _(n, user1)(f)*+|H ₂(f)|²(d _(n,2) C _(n+1,1, user2)(f)*+d _(n,1) C _(n+1,2, user2)(f)*)C _(n+1, user1)(f))df+

s _(n+1)*∫_(B) H ₁(f)H ₂(f)(|C _(n+1, user1)(f)|² −|C _(n, user1)(f)|²) df−∫ _(B) H ₁(f)*H ₂(f)(d _(n+1,2) *C _(n,1, user2)(f)+d _(n+1,1) * C _(n,2, user2)(f)C _(n, user1)(f)−(d _(n+1,1,) * C _(n+1,1, user2)(f)*+d _(n+1,2) *C _(n+1,2, user2)(f)* )C _(n+1, user1)(f))df

=s _(n)∫_(B)(|H ₁(f)C _(n, user1)(f)|² +|H ₂(f)C _(n+1, user1)(f)|²)df+

d _(n,1)∫_(B)(|H ₁(f)|² C _(n,1, user2)(f)C _(n, user1)(f)+|H₂(f)|² C _(n+1,2, user2)(f)*C _(n+1, user1)(f))df+

d _(n,2)∫_(B)(|H ₁(f)|² C _(n,2, user2)(f))C _(n, user1)(f)+|H₂(f)|² C _(n+1,1, user2)(f)*C _(n+1, user1)(f))df+

s _(n+1)*∫_(B) H ₁(f)*H ₂(f)(|C _(n+1, user1)(f)|² −C _(n, user1)(f)|²) df

−d _(n+1,1)*∫_(B) H ₁(f)*H ₂(f)(C _(n,2, user2)(f))C _(n, user1)(f)*−C _(n+1,1, user2)(f)*C _(n+1, user1)(f))df

−dn+1,2 *∫_(B) H ₁(f)*H ₂(f)(C _(n,1, user2)(f)C _(n, user1)(f)*−C _(n+1,2, user2)(f)*C _(n+1, user1)(f))df

[0162] It is seen that the last 3 terms vanish if p_(n+1, user1)(t)=p_(n, user1)(T−t)* and if

p_(n+1,1, user2)(t)=p_(n,2, user2)(T−t)* and p _(n+1,2, user2)(t)=p _(n,1, user2)(T−t)*

[0163] More generally, the STTD grouped pairs or p-tuples are preferentially arranged in arrangements by subgroups, where two subgroups are placed symmetrically, with reference to the temporal center of a sequence of two longest symbols.

[0164] More generally, in the case of n antennas and of p-tuples to be transmitted, the n-tuples transmitted at k different instants are grouped in pairs, this being possible since k is even, so that each pair exhibits a symmetry of coding with respect to the temporal center of the two longest associated symbols.

[0165] In the case of UMTS, where the interference is required to be as weak as possible also in the case where the channels are constants with respect to frequency, it is noted that with the arrangements suggested above, a third interference is also eliminated in this case.

[0166] The waveform which modulates the symbol transmitted by user i at symbol time n is denoted below by:

p _(n, useri)(t)=Σ_(k=1,F)C_(useri,k,n) p _(chip)(t−kT _(chip)) 0≦t≦T

[0167] {C_(useri,k,n)} k=1, F is a code. The values of the coefficients belong in general to a complex finite alphabet. We write C_(n,useri)(t)=Σ_(k=1,F)C_(useri,k,n)δ(t−kT_(chip))

[0168] In a preferential embodiment, the codes transmitted by 2 users i and j at the same instant n and with the same spreading factor F are orthogonal:

Σ_(k−1,F) C _(useri,k,n) C _(userj,k,n)*=0,

[0169] Orthogonality is in particular a requirement for UMTS.

[0170] In conventional systems with orthogonality, the codes were constructed in such a way as to comply with orthogonality even if the spreading factors are different. For example, consider two users, one i with spreading factor F, the other j with spreading factor F/2.

We have Σ_(k=1, F/2) C _(useri,k,n) C _(userj,k,n)=0,

Σ_(k=F/2+1,F) C _(useri,k,n) C _(userj,k−F/2+1,n+1)*=0,

[0171] These codes are for example so-called OVSF (Orthogonal Variable Spreading Factor) [4] in the case of UMTS.

[0172] In the example of an OVSF code, we are interested here in the downlink: each symbol transmitted is firstly spread by a string of chips forming an OVSF code of length equal to the spreading factor. The OVSF code and the spreading factor are characteristic of a given user: C_(useri,k,n) does not depend on n.

[0173] The OVSF codes of the same length are mutually orthogonal. When different users of spreading factor F′ and F are multiplexed, the OVSF codes associated with them are chosen in such a way as to comply with the following property: if F′/F=2^(g), then, the code of length F′ is composed of 2^(g) sequences of length F end-to-end. In the prior art, each of these sequences F is orthogonal to the OVSF code of length F placed at the same position.

[0174] To maintain orthogonality between codes of different spreading factors (hierarchical orthogonality), a series of arrangements preferentially adopted together is proposed hereinbelow.

[0175] In the case of a system where the spreading factors exhibit a ratio 2^(g) each time, one considers the maximum size of a symbol (smallest bit rate), for example the size of 128 chips. The pairs of symbols, in a signal with the smallest bit rate, thus have a size of 256 chips.

[0176] For two pairs of samples of 128 chips each transmitted simultaneously and with orthogonal codes, the first sample is coded with a given code, and the second with the conjugate and time-inverted code, this being done on both antennas.

[0177] Thus, over the first symbol the codes remain mutually orthogonal since they are not modified, and are likewise orthogonal for the second sample since they are inverted and conjugated in the same manner.

[0178] One wishes to maintain orthogonality between different spreadings, for example between a pair of symbols 100 and 200 (FIG. 3) each of length 128 chips and a series of four symbols 110, 120, 210, 220 each of length 64 chips (FIG. 3). Let us assume that a code is available over the first symbol 110 of 64 chips which is orthogonal to the code part applied over the first 64 chips of the simultaneous long symbol 100 (128 chips).

[0179] If the second symbol of 64 chips has the same code as the first but conjugated and inverted with respect to time, it is not necessarily orthogonal to the corresponding 64-chip sequence applied in second position over the long symbol 100, since the corresponding code in this symbol 100 is not inverted.

[0180] Hence, in the case of hierarchical orthogonality, a same arrangement of the codes as that suggested hereinabove for the general case of different spreading codings is proposed. The 64-bit inverted and conjugated code is placed, as is the symbol to which it is applied, that is to say the symbol grouped first by STTD, in a position placed in correspondence with a part of the second 128-chip sample 200, so that two signals with conjugate and inverse codes correspond and therefore preserve the initial hierarchical orthogonality relation.

[0181] More precisely, a short conjugate inverse code 220 is placed facing the zone of the second long sample 200, which zone is the temporal inverse of the sequence corresponding temporally to the initial uninverted 64-bit code 110.

[0182] The systematic hierarchical orthogonality relation is thus preserved.

[0183] Moreover, in a typical cellular telephony system, a very long (much longer than the spreading factor) sequence of so-called scrambling chips 400 (FIG. 4) is allocated to each cell. This sequence multiplies chip by chip the symbols 110, 120, 210, 220 previously spread by an OVSF code 300. It is complex with modulus 1. It is denoted embr. Each coded symbol 100, 200, 110, 120; 210, 220 is multiplied by a portion of length F or F′ of embr. Multiplication by this sequence does not affect the orthogonality of the codes, hence ∫|_(O, T)|_(P n, userj)(t) _(Pn. userj)*(t) dt=0.

[0184] In a system with hierarchical orthogonality such as that proposed above, certain suggestions given hereinbelow, that make it possible to preserve the advantages of the reduction of interference, are preferentially adopted.

[0185] Thus, the scrambling sequence 400 preferentially exhibits the form of pairs of sequences 410, 420, each sequence having the maximum symbol length, 128 chips here, and each pair exhibits a temporal symmetry between the two sequences 410 and 420 of the pair. The sequences 410 and 420 of the pair are also mutually conjugate. The conjugate pairs with symmetry are concomitant with the pairs of long symbols 100, 200.

[0186] Thus, in the manner described above, the symbols grouped by STTD are associated according to symmetric subgroups around points separating the pairs of sequences of 128 chips, and the same is done in respect of the scrambling which itself satisfies the character of temporal inversion and conjugation between the STTD associated pairs.

[0187] The scrambling likewise satisfying this symmetry, the STTD grouped symbols are properly coded, even when considering the scrambling, by a general coding which reduces interference. Moreover, the inter-spreading orthogonality is preserved.

[0188] Thus, the scrambling sequence 410 is, likewise, modified, so as to repeat in the reverse direction, and conjugated in each second maximum length STTD symbol:

[0189] embr_(n+1), k=embr_(n), F−k+1*

[0190] or F is the maximum symbol duration.

[0191] For each spreading symbol less than F′, a scrambling part is applied to this symbol, this part being applied simultaneously to a symbol of maximum length 100, 200. The short symbols being placed according to a symmetry with respect to the same reference instants as the scrambling, the elimination of interference is also preserved for the short symbols, as is the orthogonality.

[0192] A scrambling portion, time-inverted or otherwise, and conjugated or otherwise, is therefore applied in practice to a short symbol, depending on whether the symbol is concomitant with a first long symbol 410 or with a second long symbols 420.

[0193] Of course, when passing from a pair of long symbols 410, 420 to the next pair, the scrambling is preferentially different, although still satisfying a symmetry, and conjugated with respect to the center of the pair.

[0194] Thus, in the case of STTD grouping in groups of 2, that is to say typically with two antennas, by considering the maximum spreading factor F_(max) (256 for UMTS), the principle described consists in reversing the direction of time (and in conjugating) the scrambling of length 256 at the rate of one out of 2 by reversing these codes at the level of the centers of STTD associated long pairs. This procedure is easily generalized to the case of grouping by p-tuples where p is different from 2.

[0195] In the case of UMTS, the scrambling sequence is modified in such a way that it repeats, inverting itself and conjugating itself every F_(max) chips.

[0196] References

[0197] [1] PROAKIS Digital Communications Mc Graw-Hill

[0198] [2] N. SESHADRI, J. H. WINTERS “Two schemes for improving the performance of frequency-division duplex (FDD) transmission systems using transmitter antenna diversity” Int. J. Wireless Inform. Networks, vol.1, n°1, pp. 49-60 January 1994

[0199] [3] S. M. ALAMOUTI “A simple Transmit Diversity Technique for Wireless Communications” IEEE Journal on Selected Areas in Communications October 1998 Vol 16 n°8 pp. 1451-1458

[0200] [4] 3GPP 3G TS 25.211 V3.2.0 (Draft 1) March 2000 3G TS 25.213 V3.2.0 (Draft 1) March 2000

[0201] [5] P. BALABAN, J. SALZ “Dual diversity Combining and Equalization in Digital Cellular Mobile Radio” IEEE Trans on Vehicular Technology Vol 40 n°2 May 1991 

1. A transmission method in which: n antennas, n greater than or equal to 2, are used to transmit symbols grouped into p-tuples (S₁, . . . S_(p)), while carrying out, for each p-tuple, k times a simultaneous sending of n symbols, the n symbols consisting each time of values from among S₁,. . . , S_(p) which are in a modified order and are assigned weights chosen selectively from among −1, 0 and 1, and are selectively conjugated, so that k linear superpositions of n symbols are transmitted in such a way as to constitute a transmission matrix of dimensions k×p which is substantially orthogonal; the n antennas furthermore send each symbol with a spread spectrum coding, the codings being the same on the n antennas at each transmission concerned among the k transmissions; the transmission being performed over a physical or contrived channel which constitutes substantially a sum of Diracs, so that each superposition of symbols is repeated several times on reception; in which method furthermore: each superposition of n symbols is extracted with the aid of despreadings on reception several times; these several extractions are done with the aid of despreadings for each of the k superpositions transmitted so that several estimations of k-tuples are obtained, each k-tuple forming a result of the k×p transmission matrix; the orthogonality of the k×p matrix is exploited several times corresponding to each of the several k-tuple extractions done with the aid of despreadings, so that an estimation of the p-tuple (S₁, . . . , S_(p)) is obtained several times; and an estimation of each symbol S₁, . . . , S_(p) is deduced, sharpened on the basis of the p-tuples (S₁, . . . , S_(p)) estimated several times, characterized in that k is an even number, and that the symbols are coded according to k successive codes corresponding to the k transmissions, the k codes comprising k/2 pairs of codes which satisfy, in each pair, the property according to which a code of the pair is time-inverted and conjugated with respect to the other code of the pair, and possibly multiplied by a complex constant of modulus
 1. 2. The method as claimed in claim 1, characterized in that the number of transmissions k per p-tuple is greater than or equal to the number of antennas n.
 3. The method as claimed in claim 1 or claim 2, characterized in that the k transmissions are performed over k time intervals (110, 120, 210, 220) each having a duration F, these k intervals (110, 120, 210, 220) being distributed pairwise in a symmetric manner with respect to the center of an interval (100, 200) having a length 2^(m)F, the codes applied to two symbols placed symmetrically with respect to the center of the interval (100, 200) of length 2^(m)F being time-inverted and conjugated.
 4. The method as claimed in claim 1, characterized in that during k/2 given transmissions, symbols are transmitted that are conjugated with respect to the symbols sent in the other k/2 transmissions, and in that the codes applied to the k/2 so-called other transmissions are the temporal inverses and conjugates of the codes applied to the k/2 so-called given transmissions.
 5. A transmission method in which several signals are transmitted in a superposed manner on the antennas according to the method of claim 1, with a given symbol length, and a general code (400) of length at least equal to the given symbol length is superposed on the various codes (300) applied to these various symbols, characterized in that the general code (400) exhibits the form of a series of pairs of successive subcodes (410, 420), each pair of subcodes (410, 420) having a length equal to that of the given symbol length, and the two subcodes (410, 420) of each pair being time-inverted and conjugated with respect to one another.
 6. A transmission method in which several signals are transmitted in a superposed manner on the antennas according to the method of 4 claim 1, with different symbol lengths each expressed in the form 2^(q)F_(o) where F_(o) is the smallest symbol length, and a general code (400) of length at least equal to 2^(qmax)F_(o) is superposed on the various codes (300) applied to these various symbols, where 2^(qmax)F_(o) is the maximum symbol length, characterized in that the general code (400) exhibits the form of a series of pairs of successive subcodes (410, 420), each pair of subcodes (410, 420) having a symbol length 2^(qmax)F_(o), and the two subcodes (410, 420) of each pair being time-inverted and conjugated with respect to one another.
 7. The method as claimed in claim 1, characterized in that the antennas are n=2 in number, the symbols are transmitted in groups of p=2 for a number of transmissions k=2, so that a transmission matrix of dimensions 2×2 is obtained.
 8. The method in which several signals with different symbol lengths equal to 2^(q)F₀ where F₀ is the smallest symbol length are transmitted according to the method of claim 7, simultaneously, and in that the grouped symbol pairs are placed with reference to symbol pairs of maximum length 2^(qmax), by placing the two symbols of each pair in a symmetric manner with respect to the temporal center of a concomitant pair of symbols of maximum length 2^(qmax). 